TR-2010010: Robust Knowledge and Rationality

نویسنده

  • Sergei Artemov
چکیده

In 1995, Aumann proved that in games of perfect information, common knowledge of rationality yields backward induction. In 1998, Stalnaker provided an example of a game in which common knowledge of rationality, once belief revision is taken into account, does not yield backward induction. However, in some pertinent situations in this example, players are allowed to forfeit the rationality condition. We introduce the notion of robust knowledge which extends common knowledge to all relevant situations, including counterfactual ones. Robust knowledge of rationality, in a general belief revision setting, represents the “no irrationality in the system” condition which is at the heart of the backward induction argument. We show that in games of perfect information, robust knowledge of rationality yields backward induction. This may be regarded as a natural form of Aumann’s theorem which accommodates belief revision.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

TR-2010007: Robust Knowledge of Rationality

Stalnaker provided an example of a perfect information game in which common knowledge of rationality does not yield backward induction. However, in his example, knowledge is treated as defeasible: players forfeit their knowledge of rationality at some vertices. This is not how ‘knowledge’ is understood in epistemology where, unlike belief, it is not subject to revision. In this respect, the Sta...

متن کامل

Robust Knowledge of Rationality

Stalnaker provided an example of a perfect information game in which common knowledge of rationality does not yield backward induction. However, in his example, knowledge is treated as defeasible: players forfeit their knowledge of rationality at some vertices. This is not how ‘knowledge’ is understood in epistemology where, unlike belief, it is not subject to revision. In this respect, the Sta...

متن کامل

Robust Knowledge and Rationality

In 1995, Aumann proved that in games of perfect information, common knowledge of rationality yields backward induction. In 1998, Stalnaker provided an example of a game in which common knowledge of rationality, once belief revision is taken into account, does not yield backward induction. However, in some pertinent situations in this example, players are allowed to forfeit the rationality condi...

متن کامل

TR-2009011: Knowledge-Based Rational Decisions

We outline a mathematical model of rational decision-making based on standard game-theoretical assumptions: 1) rationality yields a payoff maximization given the player’s knowledge; 2) the standard logic of knowledge for Game Theory is the modal logic S5. Within this model, each game has a solution and rational players know which moves to make at each node. We demonstrate that uncertainty in ga...

متن کامل

TR-2009006: Intelligent Players

Rational decisions depend on what players know, hence an appropriate epistemic analysis is an integral element of the foundations of Game Theory. We suggest a general logical approach for studying games which consists of formalizing rationality and games in epistemic logic and deriving their properties in the resulting logical system. We study a number of examples and demonstrate that our model...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016